Exact Geometric Collision Detection
نویسندگان
چکیده
Exact computation is an important paradigm for the implementation of geometric algorithms. In this paper, we consider for the first time the practically important problem of collision detection under this aspect. The task is to decide whether a polyhedral object can perform a prescribed sequence of translations and rotations in the presence of stationary polyhedral obstacles. We present an exact decision method for this problem which is purely based on integer arithmetic. Our approach guarantees that the required binary length of intermediate numbers is bounded by 14L+22, where L denotes the maximal bit-size of any input value.
منابع مشابه
Quick Collision Detection of Polytopes in Virtual Environments
The problem of collision detection is fundamental to inter active applications such as computer animation and virtual environments In these elds prompt recognition of possible impacts is important for computing real time response We present a simple exact collision detection algorithm for convex polytopes The algorithm nds quickly a separating plane between two polytopes if they are non collidi...
متن کاملGuaranteed collision detection with toleranced motions
We present a method for guaranteed collision detection with toleranced motions. The basic idea is to consider the motion as a curve in the 12-dimensional space of affine displacements, endowed with an object-oriented Euclidean metric, and cover it with balls. The associated orbits of points, lines, planes and polygons have particularly simple shapes that lend themselves well to exact and fast c...
متن کاملInteractive and Exact Collision Detection for Large-Scaled Environments
We present algorithms for exact collision detection in interactive environments. Such environments are characterized by the number of objects undergoing motion and the complexity of the models. We do not assume that the motions of the objects are expressible as closed-form functions of time, nor do we assume any limitations on their velocities. The algorithms use a two-level hierarchical repres...
متن کاملAccelerating Route Planning and Collision Detection for Computer Generated Forces Using Gpus
We present algorithms to accelerate route planning and collision detection for computer generated forces. Our algorithms exploit the parallel computing capability of Graphics Processing Units (GPUs) along with their ability to perform geometric culling. We combine the GPU accelerated computations with exact intersection tests on the CPU. Our approach supports dynamic terrains and multiple featu...
متن کاملFast Collision Detection between Geometric Models
We present an efficient algorithm for collision detection and contact determination between geometric models described by linear or curved boundaries and undergoing rigid motion. The set of models include surfaces described by rational spline patches or piecewise algebraic functions. In contrast to previous approaches, wefirst present a roughly constant time algorithm for collision detection be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999